DxTer: An Extensible Tool for Optimal Dataflow Program Generation
نویسندگان
چکیده
DxTer (pronounced “dexter”) is a tool for generating high-performance program implementations of an input dataflow graph. Given a specification S of a program in some domain D, DxTer uses its knowledge base for D to explore a space of implementations of S and outputs an optimal implementation with respect to the cost model in D. While DxTer search spaces can be massive (e.g., 10), this paper describes new techniques that allow DxTer to search such spaces and generate optimal code in seconds. In a case study, we apply DxTer to the domain of tensor contractions and show that DxTer generates programs that are competitive with (and sometimes superior to) a state-of-the-art tensor contraction tool.
منابع مشابه
DxTer: A Program Synthesizer for Dense Linear Algebra
DxTer is a tool that generates a search space of implementations for operations in dense linear algebra and uses cost functions to select automatically the most efficient implementation from the space. We describe how DxTer generates this space and the optimizations it uses to reduce the size of the space to improve its runtime, such as employing phases of generation.
متن کاملDesign Tool for Multiprocessor Scheduling and Evaluation of Iterative Dataflow Algorithms
A graph-theoretic design process and software tool is defined for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search a...
متن کاملAn Automated Flow to Map Throughput Constrained Applications to a MPSoC
This paper describes a design flow to map throughput constrained applications on a Multiprocessor System-on-Chip (MPSoC). It integrates several state-of-the-art mapping and synthesis tools into an automated tool flow. This flow takes as input a throughput constrained application, modeled with a synchronous dataflow graph, a C-based implementation for each actor in the graph, and a template base...
متن کاملCode Generation and Optimization of Distributed-Memory Dense Linear Algebra Kernels
Design by Transformation (DxT) is an approach to software development that encodes domain-specific programs as graphs and expert design knowledge as graph transformations. The goal of DxT is to mechanize the generation of highly-optimized code. This paper demonstrates how DxT can be used to transform sequential specifications of an important set of Dense Linear Algebra (DLA) kernels, the level-...
متن کاملOptimal Operation of Microgrid in the presence of Real-time Pricing Demand Response Program using Artificial Bee Colony Algorithm with a Modified Choice Function
Abstract: Microgrid is one of the newest technologies in power systems. Microgrid can usually has a set of distributed energy resources that makes it able to operate separate from power grid. Optimal operation of microgrids means the optimal dispatch of power resources through day and night hours. This thesis proposed a new method for optimal operation of microgrid. In this method, real-time pr...
متن کامل